Computation of the Hankel transform using projections

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

About Calculation of the Hankel Transform Using Preliminary Wavelet Transform

The purpose of this paper is to present an algorithm for evaluating Han-kel transform of the null and the first kind. The result is the exact analytical representation as the series of the Bessel and Struve functions multiplied by the wavelet coefficients of the input function. Numerical evaluation of the test function with known analytical Hankel transform illustrates the proposed algorithm. T...

The Hankel transform

Fast computation of the continuous wavelet transform through oblique projections

We introduce a fast simple method for computing the real continuous wavelet transform (CWT). The approach achieves O N ( ) complexity per scale and the filter coefficients can be analytically obtained by a simple integration. Our method is to use P wavelets per octave and to approximate them with their oblique projection onto a space defined by a compact scaling function. The wavelet templates ...

Rapid computation of the continuous wavelet transform by oblique projections

We introduce a fast simple method for computing the real continuous wavelet transform (CWT). The approach has the following attractive features: It achieves O(N) complexity per scale, the filter coefficients can be analytically obtained by a simple integration, and the algorithm is faster than a least squares approach with negligible loss in accuracy. Our method is to use P wavelets per octave ...